منابع مشابه
Enumerating topological (nk)-configurations
An (nk)-configuration is a set of n points and n lines in the projective plane such that their point – line incidence graph is k-regular. The configuration is geometric, topological, or combinatorial depending on whether lines are considered to be straight lines, pseudolines, or just combinatorial lines. We provide an algorithm for generating, for given n and k, all topological (nk)-configurati...
متن کاملEnumerating Regular Mixed-Cell Configurations
By means of the Cayley Trick the problem of enumerating all regular ne mixed subdivisions is reduced to enumerating all regular triangulations. The set of all regular triangulations is well-understood thanks to the bijection with the vertices of the secondary polytope. However, since we are only interested in the conngurations of mixed cells in a mixed subdivision, we want to avoid dealing with...
متن کاملEnumerating the nonisomorphic assembly configurations of modular robotic systems
A \modular" robotic system consists of joint and link modules that can be assembled in a variety of conngurations to meet diierent or changing task requirements. However, due to typical symmetries in module design, diierent assembly conngurations may lead to robotic structures which are kinematically identical, or isomorphic. This paper considers how to enumerate the non-isomorphic assembly con...
متن کاملEnumerating Triangulations for Products of Two Simplices and for Arbitrary Configurations of Points
We propose algorithms to enumerate (1) classes of regular triangulations in respect of symmetry for products of two simplices and (2) all triangulations, regular or not, for arbitrary con gurations of points. There are many results for triangulations in two dimension, but little is known for higher dimensions. Both objects we enumerate in this paper are for general dimensions. Products of two s...
متن کاملEnumerating Homomorphisms
The homomorphism problem for relational structures is an abstract way of formulating constraint satisfaction problems (CSP) and various problems in database theory. The decision version of the homomorphism problem received a lot of attention in literature; in particular, the way the graph-theoretical structure of the variables and constraints influences the complexity of the problem is intensiv...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computational Geometry
سال: 2014
ISSN: 0925-7721
DOI: 10.1016/j.comgeo.2012.10.002